P-complete Problems in Data Compression

نویسنده

  • Sergio De Agostino
چکیده

De Agostino, S., P-complete problems in data compression, Theoretical Computer Science 127 (1994) 181-186. In this paper we study the parallel computational complexity of some methods for compressing data via textual substitution. We show that the Ziv-Lempel algorithm and two standard variations are P-complete. Hence an efficient parallelization of these algorithms is not possible uqless P = NC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the random property of compressed data via Huffman coding

Though Huffman codes [2,3,4,5,9] have shown their power in data compression, there are still some issues that are not noticed. In the present paper, we address the issue on the random property of compressed data via Huffman coding. Randomized computation is the only known method for many notoriously difficult #P-complete problems such as permanent, and some network reliability problems, etc [1,...

متن کامل

The Complexity of Two - DimensionalCompressed Pattern -

We consider the complexity of problems for highly compressed 2-dimensional texts: compressed pattern-matching (when the pattern is not compressed and the text is compressed) and fully compressed pattern-matching (when also the pattern is compressed). First we consider 2-dimensional compression in terms of straight-line programs, see 9]. It is a natural way for representing very highly compresse...

متن کامل

Querying and Embedding Compressed Texts

The computational complexity of two simple string problems on compressed input strings is considered: the querying problem (What is the symbol at a given position in a given input string?) and the embedding problem (Can the first input string be embedded into the second input string?). Straight-line programs are used for text compression. It is shown that the querying problem becomes P-complete...

متن کامل

Use of locking plate in combination with dynamic compression plate for repair of tibial fracture in a young horse

Grade 1 open spiral fracture of left tibia in a 1.5 year-old horse was treated using a combination of 4.5 mm locking compression plate (LCP) and a dynamic compression plate applied in a neutralization manner. The open wound was managed postoperatively by regular dressing and lavage. Radiograph at 24 days post-treatment revealed callus formation and at two months complete bridging callus was obs...

متن کامل

تأثیر فشردن قفسه سینه در زمان بازدم قبل از ساکشن داخل تراشه بر تبادل گازهای خون شریانی بیماران تحت تهویه مکانیکی

  Background & Aim : Endotracheal suctioning is one of the most frequently used methods for airway clearance in patients under mechanical ventilation. Chest physiotherapy techniques such as expiratory rib cage compression before endotracheal suctioning can be used as a means to facilitate mobilizing and removing airway secretions and improving alveolar ventilation. This study was carried out to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 127  شماره 

صفحات  -

تاریخ انتشار 1994